Berge–Fulkerson coloring for C (8) ‐linked graphs
نویسندگان
چکیده
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملSub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph G, we want to partition the vertices of G into minimum number of sub-color classes, where each sub-color clas...
متن کاملEdge-Coloring and f-Coloring for Various Classes of Graphs
In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f -coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a positive integer assigned to v. This paper gives efficient sequential and parallel algorithms to find ordinary edge-colorings and f -colorings for various classes of graphs such as bi...
متن کاملColoring Semirandom Graphs
We study semirandom k-colorable graphs made up as follows. Partition the vertex set V = {1, . . . , n} randomly into k classes V1, . . . , Vk of equal size and include each Vi-Vj -edge with probability p independently (1 ≤ i < j ≤ k) to obtain a graph G0. Then, an adversary may add further Vi-Vj-edges (i 6= j) to G0, thereby completing the semirandom graph G = G∗n,p,k . We show that if np ≥ max...
متن کاملColoring graphs using topology
Higher dimensional graphs can be used to color 2dimensional geometric graphs G. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colorable with 4 colors. The later goal is achieved if all interior edge degrees are even. Using a refinement process which cuts the interior along surfaces S we can adapt the degrees along the boundary S. More effic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2017
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22184